The Busy Period of an M/G/1 Queue with Customer Impatience
نویسندگان
چکیده
منابع مشابه
Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process
In this paper we study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is impatient or not. We obtain the Laplace-Stieltjes Transform of the joint stationary workload and arrival rate process. This queueing model also captures the interaction between congestion control algorithms and queue manageme...
متن کاملError Analysis of the Mean Busy Period of a Queue
The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.
متن کاملTransient queue length and busy period of the BMAP / PH / 1 queue
We derive in this paper the transient queue length and the busy period distributions in the single server queue with phase-type (PH) services times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precisio...
متن کاملGlobal and local asymptotics for the busy period of an M/G/1 queue
We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. This analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of the M/G/1 queue. 2000 Mathematics Subject Classification: 60K25, 60G50, 60F10.
متن کاملResponse Time Distribution in a D-map/ph/1 Queue with General Customer Impatience
This paper presents two methods to calculate the response time distribution of impatient customers in a discrete-time queue with Markovian arrivals and phase-type services, in which the customers’ patience is generally distributed (i.e., the D-MAP/PH/1 queue). The first approach uses a GI/M/1 type Markov chain and may be regarded as a generalization of the procedure presented in Van Houdt [14] ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2010
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200006446